Experimental Implementation of an Adiabatic Quantum Optimization Algorithm
نویسندگان
چکیده
منابع مشابه
Experimental implementation of an adiabatic quantum optimization algorithm.
We report the realization of a nuclear magnetic resonance computer with three quantum bits that simulates an adiabatic quantum optimization algorithm. Adiabatic quantum algorithms offer new insight into how quantum resources can be used to solve hard problems. This experiment uses a particularly well-suited three quantum bit molecule and was made possible by introducing a technique that encodes...
متن کاملQuantum adiabatic algorithm for factorization and its experimental implementation.
We propose an adiabatic quantum algorithm capable of factorizing numbers, using fewer qubits than Shor's algorithm. We implement the algorithm in a NMR quantum information processor and experimentally factorize the number 21. In the range that our classical computer could simulate, the quantum adiabatic algorithm works well, providing evidence that the running time of this algorithm scales poly...
متن کاملImplementation of Single-Qutrit Quantum Gates via Tripod Adiabatic Passage
We proposed and analyzed implementation of the single-qutrit quantum gates based on stimulated Raman adiabatic passage (STIRAP) between magnetic sublevels in atoms coupled by pulsed laser fields. This technique requires only the control of the relative phase of the driving fields but do not involve any dynamical or geometrical phases, which make it independent of the other interaction details: ...
متن کاملAn optimal adiabatic quantum query algorithm
The quantum adversary method was originally introduced by Ambainis [Amb02] for lower-bounding the quantum query complexity Q(f) of a function f . It is based on optimizing a matrix Γ assigning weights to pairs of inputs. It was later shown by Høyer et al. [HLŠ07] that using negative weights also provides a lower bound, which is stronger for some functions. A series of works [RŠ12, Rei09, Rei11]...
متن کاملNon-hermitian Adiabatic Quantum Optimization
Many physical and combinatorial problems associated with complex networks of interacting degrees of freedom can be mapped to equivalent problems of finding the ground (or minimum cost) state of a corresponding quantum Hamiltonian H0 1,2,3,4,5,6,7,8,9. One of the approaches to finding the ground state of H0 is adiabatic quantum computation which can be formulated as follows. Consider the time de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2003
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.90.067903